SIAM Journal on Computing -- 1995

By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

© SIAM

SIAM Journal on Computing

Table of Contents

Available Volumes| Issue Index| View myArticles

Search This Issue

Volume 24, Issue 6, pp. 1141-1358

Please Note: Electronic articles are available well in advance of the printed articles.

On the Generation of Random Binary Search Trees

Luc Devroye and John Michael Robson

pp. 1141-1156

BibTeX Abstract Full Text: PDF

On the Variance of the Height of Random Binary Search Trees

Luc Devroye and Bruce Reed

pp. 1157-1162

BibTeX Abstract Full Text: PDF

Constructing Huffman Trees in Parallel

Lawrence L. Larmore and Teresa M. Przytycka

pp. 1163-1169

BibTeX Abstract Full Text: PDF

Weakly Hard Problems

pp. 1170-1189

BibTeX Abstract Full Text: PDF

Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues

Adam L. Buchsbaum, Rajamani Sundar, and Robert E. Tarjan

pp. 1190-1206

BibTeX Abstract Full Text: PDF

Adaptive Pattern Matching

R. C. Sekar, R. Ramesh, and I. V. Ramakrishnan

pp. 1207-1234

BibTeX Abstract Full Text: PDF

Finding Regular Simple Paths in Graph Databases

Alberto O. Mendelzon and Peter T. Wood

pp. 1235-1258

BibTeX Abstract Full Text: PDF

What Can be Computed Locally?

Moni Naor and Larry Stockmeyer

pp. 1259-1277

BibTeX Abstract Full Text: PDF

Identifying the Minimal Transversals of a Hypergraph and Related Problems

Thomas Eiter and Georg Gottlob

pp. 1278-1304

BibTeX Abstract Full Text: PDF

On the Reuse of Additions in Matrix Multiplication

pp. 1305-1312

BibTeX Abstract Full Text: PDF

Scheduling Parallel Machines On-Line

David B. Shmoys, Joel Wein, and David P. Williamson

pp. 1313-1331

BibTeX Abstract Full Text: PDF

Computing Minimal Spanning Subgraphs in Linear Time

Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, and Robert Tarjan

pp. 1332-1358

BibTeX Abstract Full Text: PDF